Simulated Annealing to Unfold 3D Meshes and Assign Glue Tabs
نویسندگان
چکیده
منابع مشابه
Repairing Non-Manifold Triangle Meshes using Simulated Annealing
In the field of reverse engineering one often faces the problem of repairing triangulations with holes, intersecting triangles, Möbius-band-like structures or other artifacts. In this paper we present a novel approach for generating manifold triangle meshes from such incomplete or imperfect triangulations. Even for heavily damaged triangulations, representing closed surfaces with arbitrary genu...
متن کامل3D Graph Drawing with Simulated Annealing
A recent trend in graph drawing is directed to the visualiza-tion of graphs in 3D 1, 5, 6]. A promising research direction concerns the extension of proven 2D techniques to 3D. We present a system extending the simulated annealing algorithm of Davidson and Harel 2] for straight-line two-dimensional drawings of general undirected graphs to three dimensions. This system features an advanced 3D us...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملSimulated annealing
Metaheuristics are general problem solving algorithms which abstract from the actual problem description. Therefore they can be easily applied to many optimization problems. Simulated annealing is a simple and fast metaheuristic with an analogy to metal processing. As metal particles generate a solid and regular structure when cooling slowing simulated annealing seeks a low-energy solution avoi...
متن کاملOn Simulated Annealing and Nested Annealing
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of WSCG
سال: 2020
ISSN: 1213-6972
DOI: 10.24132/jwscg.2020.28.6